A framework for block ILU factorizations using block-size reduction
نویسندگان
چکیده
منابع مشابه
Block Algorithms for Orthogonal Symplectic Factorizations
On the basis of a new WY -like representation block algorithms for orthogonal symplectic matrix factorizations are presented. Special emphasis is placed on symplectic QR and URV factorizations. The block variants mainly use level 3 (matrix-matrix) operations that permit data reuse in the higher levels of a memory hierarchy. Timing results show that our new algorithms outperform standard algorit...
متن کاملFinding Exact and Approximate Block Structures for ILU Preconditioning
Sparse matrices which arise in many applications often possess a block structure which can be exploited in iterative and direct solution methods. These block-matrices have as their entries small dense blocks with constant or variable dimensions. Block versions of incomplete LU factorizations which have been developed to take advantage of such structures give rise to a class of preconditioners t...
متن کاملAlgorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
We review algorithms developed for nonnegativematrix factorization (NMF) and 1 nonnegative tensor factorization (NTF) from a unified view based on the block coordinate 2 descent (BCD) framework. NMF and NTF are low-rank approximation methods for matri3 ces and tensors in which the low-rank factors are constrained to have only nonnegative 4 elements. The nonnegativity constraints have been shown...
متن کاملOptimum Block Size in Separate Block Bootstrap to Estimate the Variance of Sample Mean for Lattice Data
The statistical analysis of spatial data is usually done under Gaussian assumption for the underlying random field model. When this assumption is not satisfied, block bootstrap methods can be used to analyze spatial data. One of the crucial problems in this setting is specifying the block sizes. In this paper, we present asymptotic optimal block size for separate block bootstrap to estimate the...
متن کاملOn twisted factorizations of block tridiagonal matrices
Non-symmetric and symmetric twisted block factorizations of block tridiagonal matrices are discussed. In contrast to non-blocked factorizations of this type, localized pivoting strategies can be integrated which improves numerical stability without causing any extra fill-in. Moreover, the application of such factorizations for approximating an eigenvector of a block tridiagonal matrix, given an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1995
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1995-1257575-9